Self-adjusting grid networks to minimize expected path length
نویسندگان
چکیده
منابع مشابه
Self-Adjusting Networks to Minimize Expected Path Length
Given a network infrastructure (e.g., a grid, datacenter or on-chip-network) and a distribution on the sourcedestination requests, the expected path (route) length is an important measure for the performance, efficiency and power consumption of the network. In this work we initiate a study on self-adjusting networks: networks that use local-distributed mechanisms to adjust the position of the n...
متن کاملSelf-designing group sequential trials to minimize expected sample size
Sample size estimation is an essential step in the design of clinical trials. For normal data, the calculation is based on estimates of the mean and variance of the treatment effect. These estimates are often unreliable because they are based on smaller studies, possibly looking at a different population than the one of interest. If the true treatment effect is overestimated and/or the variance...
متن کاملThe Expected Length of a Shortest Path
Davis, R. and A. Prieditis, The expected length of a shortest path, Information Processing Letters 46 (1993) 135-141. We derive an exact summation formula and a closed-form approximation for the expected length of a shortest path for a complete graph where the arc lengths are independent and exponentially distributed random variables. Experimental data validates both results. The property of co...
متن کاملExpected Path Degradation when Searching over a Sparse Grid Hierarchy
The traditional focus of combinatorial search research is to speed up the search algorithm. An alternative, however, is to create a sparser representation of the search space. This relates to the idea of spanners from graph theory. These are subgraphs which retain paths between any two vertices of the original graph while guaranteeing a maximum stretch in path length. In practice, the path degr...
متن کاملConcurrent self-adjusting distributed tree networks
SplayNets are a distributed generalization of the classic splay tree data structures. Given a set of communication requests and a network comprised of n nodes, such that any pair of nodes is capable of establishing a direct connection, the goal is to dynamically find a (locally routable) binary tree topology, which connects all nodes and optimizes the routing cost for that communication pattern...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.11.036